Method for transmitting and receiving uplink control information, terminal, base station

ABSTRACT

A method for transmitting and receiving Uplink Control Information (UCI), a terminal, and a base station are provided. The transmitting method includes: calculating the number (Q′) of modulation symbols occupied by the UCI to be transmitted; dividing the information bit sequence of the UCI to be transmitted into two parts; using Reed Muller (RM) (32, 0) codes to encode each part of information bit sequence of the UCI to be transmitted to obtain a 32-bit coded bit sequence respectively, and performing rate matching so that the rate of the first 32-bit coded bit sequence is ┌Q′/2┐×Q m  bits and that the rate of the second 32-bit coded bit sequence is (Q′−┌Q′/2┐)×Q m  bits; and mapping the two parts of coded bit sequences that have undergone rate matching onto a Public Uplink Shared Channel (PUSCH), and transmitting the coded bit sequences to a base station.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/660,476, filed on Mar. 17, 2015, which is a continuation of U.S. patent application Ser. No. 14/098,201, filed on Dec. 5, 2013. The U.S. patent application Ser. No. 14/098,201 is a continuation of U.S. patent application Ser. No. 13/365,718, filed on Feb. 3, 2012, which is a continuation of International Application No. PCT/CN2011/075504, filed on Jun. 9, 2011. The International Application No. PCT/CN2011/075504 claims priority to Chinese Patent Application No. CN201010556633.2, filed on Nov. 15, 2010, The afore-mentioned patent applications are hereby incorporated by reference in their entireties.

FIELD OF THE APPLICATION

The present application relates to radio communication field, and in particular, to a method for transmitting and receiving Uplink Control Information (UCI), a terminal, and a base station.

BACKGROUND OF THE APPLICATION

A TDD (Time Division Duplexing, Time Division Duplexing) system sends and receives information on one frequency channel, but the receiving and the sending of the information use different time slots of one frequency carrier. The data transmission of the downlink subframe corresponds to UCI such as response information, which is generally fed back through an uplink subframe.

A LTE (Long Term Evolution, Long Term Evolution) TDD system includes 7 uplink-downlink subframe configurations. In some of uplink-downlink subframe configurations, the number of downlink subframes is greater than the number of uplink subframes, and it is possible that the UCI corresponding to data transmission of multiple downlink subframes need to be fed back on the same uplink subframe. The UCI is generally encoded through RM (Reed Muller, Reed Muller) (32, O) code before being transmitted to the base station.

An LTE-A (Long Term Evolution Advanced, Long Term Evolution Advanced) system is a further evolved and enhanced LTE system. In an LTE-A TDD system, carrier aggregation is introduced. When a terminal accesses multiple component carriers simultaneously, the terminal needs to feed back UCI on the same uplink carrier, where the UCI is UCI of multiple downlink subframes from multiple downlink component carriers. Therefore, the bits occupied by UCI on one uplink subframe increase significantly. When the number of bits occupied by UCI exceeds the maximum number of bits (11 bits) supported by RM (32, O) code, it is urgent to put forward a solution to transmitting UCI, which is lacking in the prior art.

SUMMARY OF THE APPLICATION

An embodiment provides a method for transmitting and receiving UCI, a terminal, and a base station to transmit UCI to resolve the problem that the number of occupied bits exceeds the maximum number of bits supported by RM (32, O) code. The technical solution is as follows:

A method for transmitting UCI includes:

calculating the number Q′ of modulation symbols occupied by UCI to be transmitted;

dividing an information bit sequence of the UCI to be transmitted into two parts;

using RM (32, O) code to encode each part of the information bit sequence of the UCI to be transmitted to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence respectively to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set a second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m), bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI to be transmitted, and ┌ ┐ refers to rounding up; and

mapping the two parts of coded bit sequences that have undergone rate matching onto a Physical Uplink Shared Channel PUSCH and transmitting the two parts of the coded bit sequences to a base station.

In one aspect, the mapping the two parts of coded bit sequences that have undergone rate matching onto the PUSCH and transmitting the two parts of the coded bit sequences to the base station includes: concatenating the two parts of coded bit sequences that have undergone rate matching to form a new bit sequence, mapping the new bit sequence onto the PUSCH, and transmitting the new bit sequence to the base station; or selecting alternately 4^(Q) ^(m) coded bits in one of the two parts of coded bit sequences that have undergone rate matching and 4^(Q) ^(m) coded bits in the other part of coded bit sequences that have undergone rate matching to form a new bit sequence, mapping the new bit sequence onto the PUSCH, and transmitting the new bit sequence to the base station; or selecting alternately Q_(m) coded bits in one of the two parts of the coded bit sequences that have undergone rate matching and Q_(m) coded bits in the other part of the coded bit sequences that have undergone rate matching; after 4^(Q) ^(m) coded bits are selected, switching order of selecting alternately the two parts of coded bit sequences that have undergone rate matching, going on selecting the coded bits alternately to form a new bit sequence, mapping the new bit sequence onto the PUSCH, and transmitting the new bit sequence to the base station.

In another aspect, the setting the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching includes: if a value of ┌Q′/2┐×Q_(m) is less than or equal to 32, selecting first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence; if the value of ┌Q′/2┐×Q_(m) is greater than 32, according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), performing rate matching to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence, wherein q_(i) is a coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, O_(n) is a bit in the information bit sequence corresponding to the first 32-bit coded bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence.

In another aspect, the step of setting the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching includes: if a value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32, selecting first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence; if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32, according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), performing rate matching to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is a coded bit sequence output after the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, O_(n) is a bit in the information bit sequence corresponding to the second 32-bit coded bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence.

In another aspect, the performing rate matching for each 32-bit coded bit sequence respectively is: performing rate matching for each 32-bit coded bit sequence respectively by circular repetition.

A method for receiving UCI includes:

receiving UCI sent by a terminal, and calculating the number Q′ of modulation symbols occupied by the UCI;

determining candidate control information bit sequences according to the number of bits of the UCI;

dividing each candidate control information bit sequence into two parts;

using RM (32, O) code to encode each part of each candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively, and performing rate matching for each 32-bit coded bit sequence to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set a second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI, and ┌ ┐ refers to rounding up; and

detecting the UCI by using the two parts of coded bit sequences which correspond to each candidate control information bit sequence and have undergone rate matching.

In one aspect, the detecting the Uplink Control Information by using the two parts of coded bit sequences which correspond to each candidate control information bit sequence and have undergone rate matching includes: concatenating the two parts of coded bit sequences that have undergone rate matching to form a new bit sequence, and using the new bit sequence to detect the Uplink Control Information; or selecting alternately 4^(Q) ^(m) coded bits in one of the two parts of coded bit sequences that have undergone rate matching and 4^(Q) ^(m) coded bits in the other part of coded bit sequences that have undergone rate matching to form a new bit sequence, and using the new bit sequence to detect the UCI; or selecting alternately Q_(m) coded bits in one of the two parts of the coded bit sequences that have undergone rate matching and Q_(m) coded bits in the other part of coded bit sequences that have undergone rate matching; after 4^(Q) ^(m) coded bits are selected, switching order of selecting alternately the two parts of coded bit sequences that have undergone rate matching, going on selecting the coded bits alternately to form a new bit sequence, and using the new bit sequence to detect the Uplink Control Information.

In another aspect, the setting the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching includes: if a value of ┌Q′/2┐×Q_(m) is less than or equal to 32, selecting first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence; and if the value of ┌Q′/2┐×Q_(m) is greater than 32, according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), performing rate matching to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence, wherein q_(i) is a coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, O_(n) is a bit in the information bit sequence corresponding to the first 32-bit coded bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence.

In another aspect, the setting the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching includes: if a value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32, selecting first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence; and if the value of (Q′−┌Q′/2┐)×Q_(m) greater than 32, according to q_(i)=b_((imod32)) (i=0,1, . . . , ((┌Q′/2┐×Q_(m)−1)), performing rate matching to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is a coded bit sequence output after the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, O_(n) is a bit in the information bit sequence corresponding to the second 32-bit coded bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence.

A terminal includes:

a calculating module, configured to calculate the number Q′ of modulation symbols occupied by UCI to be transmitted, and obtain modulation order Q_(m) corresponding to the UCI to be transmitted;

a first dividing module, configured to divide an information bit sequence of the UCI to be transmitted in the calculating module into two parts;

a first encoding module, configured to use RM (32, O) code to encode each part of the information bit sequence of the UCI to be transmitted to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set a second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is the modulation order corresponding to the UCI to be transmitted, and ┌ ┐ refers to rounding up; and

a transmitting module, configured to map the two parts of coded bit sequences that have undergone rate matching onto a Physical Uplink Shared Channel PUSCH, and transmit the two parts of the coded bit sequences to a base station.

In one aspect, the transmitting module includes at least one of the following transmitting units: a first transmitting unit, configured to concatenate the two parts of coded bit sequences that have undergone rate matching to form a new bit sequence, map the new bit sequence onto the PUSCH, and transmit the new bit sequence to the base station; a second transmitting unit, configured to select alternately 4^(Q) ^(m) coded bits in one of the two parts of coded bit sequences that have undergone rate matching and 4^(Q) ^(m) coded bits in the other part of coded bit sequences that have undergone rate matching to form a new bit sequence, map the new bit sequence onto the PUSCH, and transmit the new bit sequence to the base station; and a third transmitting unit, configured to select alternately Q_(m) coded bits in one of the two parts of coded bit sequences that have undergone rate matching and Q_(m) coded bits in the other part of coded bit sequences that have undergone rate matching, and, after 4^(Q) ^(m) coded bits are selected, switch the order of selecting alternately the two parts of coded bit sequences that have undergone rate matching, go on selecting the coded bits alternately to form a new bit sequence, map the new bit sequence onto the PUSCH and transmit it to the base station.

In another aspect, the first encoding module includes: a first encoding unit, configured to use Reed Muller (RM) (32, O) code to encode each part of information bit sequence of the UCI to be transmitted, which is divided by the first dividing module, to obtain a 32-bit coded bit sequence respectively; a first obtaining unit, configured to obtain a bit O_(n) of the information bit sequence corresponding to the first 32-bit coded bit sequence obtained by the first encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence; a first rate matching unit, configured to: select first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence obtained by the first encoding unit if the value of ┌Q′/2┐×Q_(m) is less than or equal to 32, or perform rate matching for the first 32-bit coded bit sequence to set the sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)) if the value of ┌Q′/2┐×Q_(m) is greater than 32, wherein q_(i) is a coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the first obtaining unit; a second obtaining unit, configured to obtain the bit O_(n) of the information bit sequence corresponding to the second 32-bit coded bit sequence obtained by the first encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence; and a second rate matching unit, configured to: select first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence obtained by the first encoding unit if the value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32, or perform rate matching for the second 32-bit coded bit sequence to set the sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)) if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32, wherein q_(i) is a coded bit sequence output after the second 32-bit coded bit sequence is set (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the second obtaining unit.

A base station includes:

a receiving module, configured to receive UCI sent by a terminal, calculate the number Q′ of modulation symbols occupied by the UCI, and obtain modulation order Q_(m) corresponding to the UCI;

a determining module, configured to determine candidate control information bit sequences according to the number of bits of the UCI received by the receiving module;

a second dividing module, configured to divide each candidate control information bit sequence determined by the determining module into two parts;

a second encoding module, configured to use RM (32, O) code to encode each part of each candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set a second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI, and ┌ ┐ refers to rounding up; and

a detecting module, configured to detect the UCI by using the two parts of coded bit sequences which correspond to each candidate control information bit sequence and have undergone rate matching.

In one aspect, the detecting module includes at least one of the following detecting units: a first detecting unit, configured to concatenate the two parts of coded bit sequences that have undergone rate matching to form a new bit sequence, and use the new bit sequence to detect the Uplink Control Information; a second detecting unit, configured to select alternately 4^(Q) ^(m) coded bits in one of the two parts of coded bit sequences that have undergone rate matching and 4^(Q) ^(m) coded bits in the other part of coded bit sequences that have undergone rate matching to form a new bit sequence, and use the new bit sequence to detect the Uplink Control Information; and a third detecting unit, configured to select alternately Q_(m) coded bits in one of the two parts of coded bit sequences that have undergone rate matching and Q_(m) coded bits in the other part of coded bit sequences that have undergone rate matching, and, after 4^(Q) ^(m) coded bits are selected, switch the order of selecting alternately the two parts of coded bit sequences that have undergone rate matching, go on selecting the coded bits alternately to form a new bit sequence, and use the new bit sequence to detect the Uplink Control Information.

In another aspect, the second encoding module includes: a second encoding unit, configured to use Reed Muller (RM) (32, O) code to encode each part of each candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively; a third obtaining unit, configured to obtain a bit O_(n) of the information bit sequence corresponding to the first 32-bit coded bit sequence obtained by the second encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence; a third rate matching unit, configured to: select first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence if the value of ┌Q′/2┐×Q_(m) is less than or equal to 32, or perform rate matching for the first 32-bit coded bit sequence to set the sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)) if the value of ┌Q′/2┐×Q_(m) is greater than 32, wherein q_(i) is a coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the third obtaining unit; a fourth obtaining unit, configured to obtain a bit O_(n) of the information bit sequence corresponding to the second 32-bit coded bit sequence obtained by the second encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence; and a fourth rate matching unit, configured to: select first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence if the value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32, or perform rate matching for the second 32-bit coded bit sequence to set the sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , ((┌Q′/2┐×Q_(m)−1)) if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32, wherein q_(i) is a coded bit sequence output after the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right)\mspace{11mu} {mod}\; 2\left( {{j = 0},1,\ldots \mspace{14mu},31} \right)}}$

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the fourth obtaining unit.

A method for receiving UCI includes:

calculating the number Q′ of modulation symbols occupied by UCI sent by a terminal, where the UCI includes a first part of UCI and a second part of UCI; and

separating the modulation symbols of the UCI according to Q′, where the first part of UCI corresponds to ┌Q′/2┐ modulation symbols and the second part of UCI corresponds to (Q′−┌Q′/2┐) modulation symbols.

In one aspect, the ┌Q′/2┐ modulation symbols corresponding to the first part of UCI and the (Q′−┌Q′/2┐) modulation symbols corresponding to the second part of UCI are mapped to 4 SC-FDMA symbols respectively.

The technical solution brings the following benefits:

The information bit sequence of the UCI is divided into two parts, and each part is encoded to generate a 32-bit coded bit sequence respectively; rate matching is performed for each 32-bit coded bit sequence respectively and then the coded bit sequence is transmitted, and therefore, the UCI which occupies bits more than the maximum number of bits supported by RM (32, O) code is transmitted properly. Moreover, each part of information bit sequence of the UCI obtains enough coding gain even if (Q′−┌Q′/2┐)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart of a method for transmitting UCI according to Embodiment 1;

FIG. 2 is a schematic diagram of UCI resource mapping on each layer of PUSCH according to Embodiment 1;

FIG. 3 is a flowchart of a method for receiving UCI according to Embodiment 1;

FIG. 4 is a flowchart of a method for transmitting UCI according to Embodiment 2;

FIG. 5 is a flowchart of a method for receiving UCI according to Embodiment 2;

FIG. 6 is a flowchart of a method for transmitting UCI according to Embodiment 3;

FIG. 7 is a schematic diagram of UCI resource mapping on each layer of PUSCH corresponding to mode 1 according to Embodiment 3;

FIG. 8 is a schematic diagram of UCI resource mapping on each layer of PUSCH corresponding to mode 2 according to Embodiment 3;

FIG. 9 is a schematic diagram of UCI resource mapping on each layer of PUSCH corresponding to mode 3 according to Embodiment 3;

FIG. 10 is a flowchart of a method for receiving UCI according to Embodiment 3;

FIG. 11 is a schematic structure diagram of a terminal according to Embodiment 4;

FIG. 12 is a schematic structure diagram of a base station according to Embodiment 5;

FIG. 13 is a flowchart of a method for transmitting UCI according to Embodiment 6; and

FIG. 14 is a flowchart of a method for receiving UCI according to Embodiment 6.

DETAILED DESCRIPTION OF THE EMBODIMENTS

To make the technical solution, objectives and merits clearer, the following describes the embodiments in more detail with reference to accompanying drawings.

Embodiment 1

As shown in FIG. 1, this embodiment provides a method for transmitting UCI. On the terminal side, the method includes the following steps:

101: Calculate the number Q′ of modulation symbols occupied by UCI to be transmitted.

If a PUSCH (Physical Uplink Share Channel, Physical Uplink Share Channel,) corresponds to multiple layers, this step calculates the number of modulation symbols occupied by the UCI on each layer of the PUSCH. The UCI may be ACK (Acknowledgment, Acknowledgment)/NACK (Negative Acknowledgement, Negative Acknowledgement), RI (Rank Indication, Rank Indication), or other control information. The type of the UCI is not limited herein.

Q′ is calculated through:

$\begin{matrix} {Q^{\prime} = {\min\left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH}\text{-}{initial}} \times N_{symb}^{{PUSCH}\text{-}{initial}} \times \beta_{offset}^{PUSCH}}{{\sum\limits_{r = 0}^{C^{(0)} - 1}K_{r}^{(0)}} + {\sum\limits_{r = 0}^{C^{(1)} - 1}K_{r}^{(1)}}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (1) \end{matrix}$

In the formula above, O is the number of bits of original information of the UCI; M_(sc) ^(PUSCH-initial) is the transmission bandwidth of the PUSCH of the same data transport block transmitted initially; M_(sc) ^(PUSCH) is the transmission bandwidth of the PUSCH of the current subframe; N_(symb) ^(PUSCH-initial) is the number of SC-FDMA (Single-Carrier Frequency-Division Multiple Access, Single-Carrier Frequency-Division Multiple Access) symbols occupied by the same transport block transmitted initially; β_(offset) ^(PUSCH) is an offset of the UCI relative to MCS (Modulation and Coding Scheme, Modulation and Coding Scheme) of the data, and β_(offset) ^(PUSCH)=β_(offset) ^(HARQ-ACK) when the UCI is HARQ-ACK, or β_(offset) ^(PUSCH)=β_(offset) ^(RI) when the UCI is RI, where the values of β_(offset) ^(HARQ-ACK) and β_(offset) ^(RI) are signalled by an high layers Radio Resource Control (RRC) signaling, and are selected based on the multiple-input multiple-output (MIMO) transmission mode of the PUSCH; when the PUSCH carries two data transport blocks, C⁽⁰⁾ is the number of code blocks generated by segmenting the data corresponding to the first data transport block when performing channel coding, and C⁽¹⁾ is the number of code blocks generated by segmenting the data corresponding to the second data transport block when performing channel coding; K_(r) ⁽⁰⁾is a sum of the number of information bits of block r (namely, the block numbered r) of the first data transport block and the number of Cyclic Redundancy Check (CRC) bits, and K_(r) ⁽¹⁾ is a sum of the number of information bits of block r of the second data transport block and the number of CRC bits; and min refers to taking the minimum value, and ┌ ┐ refers to rounding up.

Note that if the PUSCH corresponds to only one data transport block (namely, only one codeword exists), the Q′ may be calculated through formula (2). Formula (2) is a result of simplifying formula (1), and the meanings of the symbols in formula (2) are the same as those in formula (1).

$\begin{matrix} {Q^{\prime} = {\min\left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH}\text{-}{initial}} \times N_{symb}^{{PUSCH}\text{-}{initial}} \times \beta_{offset}^{PUSCH}}{\sum\limits_{r = 0}^{C - 1}K_{r}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (2) \end{matrix}$

In the formula above, C is the number of code blocks generated by dividing the data corresponding to the data transport block at the time of channel coding; and K_(r) is the sum of the number of information bits of block r of the data transport block and the number of CRC bits.

102: Divide the information bit sequence of the UCI to be transmitted into two parts.

Note that in this embodiment, the information bit sequence of the UCI refers to the original information bit sequence of the UCI. For example, if the UCI to be transmitted is ACK/NACK composed of 12 bits, the information bit sequence in this embodiment is one of the corresponding 4096 information bit sequences, for example, 12 zeros.

This embodiment does not restrict the method of dividing the information bit sequence of the UCI into two parts. Preferably, the dividing method is: If the number of bits of the UCI is an even number, the information bit sequence is divided into two equal parts; if the number of bits of the UCI is an odd number, the information bit sequence is divided into two parts, with one part being greater than the other part by one bit.

103: Use RM (32, O) code to encode each part of information bit sequence of the UCI to obtain a 32-bit coded bit sequence respectively, and remove the 8 bits at the end to obtain a 24-bit coded bit sequence.

104: Select alternately Q_(m) coded bits in one of the 24-bit coded bit sequences and Q_(m) coded bits in the other 24-bit coded bit sequence to form a 48-bit coded bit sequence, and perform rate matching for the 48-bit coded bit sequence to set the sequence to Q′×Q_(m) bits coded bit sequence.

Q_(m) above is the modulation order corresponding to the UCI to be transmitted.

105: Map the coded bit sequence that has undergone rate matching onto a PUSCH, and transmit the coded bit sequence to a base station.

FIG. 2 is a schematic diagram of UCI resource mapping on each layer of PUSCH.

In the transmission method provided in this embodiment, the information bit sequence of the UCI is divided into two parts, and each part is encoded by using RM (32, O) code to obtain a 32-bit coded bit sequence respectively; and the 8 bits at the end are removed to obtain a 24-bit coded bit sequence; a 48-bit coded bit sequence is generated by selecting alternately Q_(m) coded bits in one of the 24-bit coded bit sequences and Q_(m) coded bits in the other 24-bit coded bit sequence; and rate matching is performed for the 48-bit coded bit sequence to set the sequence to Q′×Q_(m) bits coded bit sequence before transmission. In this way, the UCI is transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by the RM (32, O) code.

As shown in FIG. 3, this embodiment provides a method for receiving UCI. On the base station side, the method includes the following steps:

201: Receive UCI sent by a terminal.

This step includes the following two steps:

201 a: Calculate the number Q′ of modulation symbols occupied by the UCI sent by the terminal.

This step is the same as step 101.

201 b: Separate the UCI transmitted together with the data according to Q′.

In this step, the base station separates the UCI transmitted together with the data, and specifically, separates the modulation symbols corresponding to the UCI transmitted together with the data, according to the number of modulation symbols occupied by the UCI in step 201 a and the resource location shown in FIG. 2, or, further according to the step of channel deinterleaving.

202: Determine multiple candidate control information bit sequences according to the number of bits of the UCI, and encode each candidate control information bit sequence.

Specifically, find all the bit sequences which include bits with the number equivalent to the number of bits of the UCI to be detected, and use the bit sequences as candidate control information bit sequences. For example, when the number of bits of UCI transmitted together with the data is 12, there are 2¹² candidate control information bit sequences.

The base station encodes each candidate control information bit sequence respectively, and the encoding includes the following steps:

202 a: Divide each candidate control information bit sequence into two parts.

202 b: Use RM (32, O) code to encode each part of the candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively, and remove the 8 bits at the end to obtain a 24-bit coded bit sequence.

202 c: Select alternately Q_(m) coded bits in one of the 24-bit coded bit sequences and Q_(m) coded bits in the other 24-bit coded bit sequence to form a 48-bit coded bit sequence, and perform rate matching for the 48-bit coded bit sequence to set the rate of the sequence to Q′×Q_(m) bits.

203: Detect the UCI according to the coded bit sequence that has undergone rate matching.

The detection criteria in this step come in many types such as maximum likelihood, and are not limited herein.

The receiving method provided in this embodiment corresponds to the transmitting method provided in this embodiment. Through this receiving method, the terminal side can transmit UCI according to the transmission method provided in this embodiment, and therefore, the UCI can be transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by RM (32, O) code.

Embodiment 2

As shown in FIG. 4, this embodiment provides a method for transmitting UCI. The method includes:

301: Calculate the number Q′ of modulation symbols occupied by UCI to be transmitted.

302: Divide the information bit sequence of the UCI to be transmitted into two parts.

303: Use RM (32, O) code to encode each part of the information bit sequence of the UCI to be transmitted to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI to be transmitted, and ┌ ┐ refers to rounding up.

304: Map the two parts of coded bit sequences that have undergone rate matching onto a PUSCH and transmit the two parts of the coded bit sequences to a base station.

As shown in FIG. 5, this embodiment provides a method for receiving UCI. The method includes:

401: Receive the UCI sent by the terminal, and calculate the number Q′ of modulation symbols occupied by the UCI.

402: Determine candidate control information bit sequences according to the number of bits of the UCI.

403: Divide each candidate control information bit sequence into two parts.

404: Use RM (32, O) code to encode each part of each candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI, and ┌ ┐ refers to rounding up.

405: Detect the UCI by using the two parts of coded bit sequences which correspond to each candidate control information bit sequence and have undergone rate matching.

Through the transmitting method provided in this embodiment, the information bit sequence of the UCI is divided into two parts, and each part is encoded to generate a 32-bit coded bit sequence respectively; rate matching is performed for each 32-bit coded bit sequence respectively and then the coded bit sequence is transmitted, and therefore, the UCI which occupies bits more than the maximum number of bits supported by RM (32, O) code is transmitted properly. Compared with the technical solution in Embodiment 1 above, this embodiment makes each part of information bit sequence of the UCI obtain enough coding gain even if the (Q′/2)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

The receiving method provided in this embodiment corresponds to the transmitting method provided in this embodiment. Through this receiving method, the terminal side can transmit UCI according to the transmission method provided in this embodiment, and therefore, the UCI can be transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by RM (32, O) code. Compared with the technical solution in Embodiment 1 above, this embodiment makes each part of information bit sequence of the UCI obtain enough coding gain even if the (Q′/2)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

Embodiment 3

As shown in FIG. 6, this embodiment provides a method for transmitting UCI. On the terminal side, the method includes the following steps:

501: Calculate the number Q′ of modulation symbols occupied by the UCI to be transmitted.

This step is the same as step 101, and is described briefly below.

If the PUSCH corresponds to multiple layers, this step calculates the number of modulation symbols occupied by the UCI on each layer of the PUSCH. The UCI may be ACK (Acknowledgment, Acknowledgment)/NACK (Negative Acknowledgement, Negative Acknowledgement), RI (Rank Indication, Rank Indication), or other control information. The type of the UCI is not limited herein.

Q′ is calculated through:

$\begin{matrix} {Q^{\prime} = {\min\left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH}\text{-}{initial}} \times N_{symb}^{{PUSCH}\text{-}{initial}} \times \beta_{offset}^{PUSCH}}{{\sum\limits_{r = 0}^{C^{(0)} - 1}K_{r}^{(0)}} + {\sum\limits_{r = 0}^{C^{(1)} - 1}K_{r}^{(1)}}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (1) \end{matrix}$

In the formula above, O is the number of bits of original information of the UCI; M_(sc) ^(PUSCH-initial) is the transmission bandwidth of the PUSCH of the same data transport block transmitted initially; M_(sc) ^(PUSCH) is the transmission bandwidth of the PUSCH of the current subframe; N_(symb) ^(PUSCH-initial) is the number of SC-FDMA (Single-Carrier Frequency-Division Multiple Access, Single-Carrier Frequency-Division Multiple Access) symbols occupied by the same transport block transmitted initially; β_(offset) ^(PUSCH) is an offset of the UCI relative to MCS (Modulation and Coding Scheme, Modulation and Coding Scheme) of the data, and β_(offset) ^(PUSCH)=β_(offset) ^(HARQ-ACK) when the UCI is HARQ-ACK, or β_(offset) ^(PUSCH)=β_(offset) ^(RI) when the UCI is RI, where the values of β_(offset) ^(HARQ-ACK) and β_(offset) ^(RI) are signalled by an high layers RRC signaling, and are selected based on the MIMO transmission mode of the PUSCH; when the PUSCH carries two data transport blocks, C⁽⁰⁾ is the number of code blocks generated by segmenting the data corresponding to the first data transport block when performing channel coding, and C⁽¹⁾ is the number of code blocks generated by segmenting the data corresponding to the second data transport block when performing channel coding; K_(r) ⁽⁰⁾ is a sum of the number of information bits of block r (namely, the block numbered r) of the first data transport block and the number of CRC bits, and K_(r) ⁽¹⁾ is a sum of the number of information bits of block r of the second data transport block and the number of CRC bits; and min refers to taking the minimum value, and ┌ ┐ refers to rounding up.

Note that if the PUSCH corresponds to only one data transport block (namely, only one codeword exists), the Q′ may be calculated through formula (2). Formula (2) is a result of simplifying formula (1), and the meanings of the symbols in formula (2) are the same as those in formula (1).

$\begin{matrix} {Q^{\prime} = {\min\left( {\left\lceil \frac{O \times M_{sc}^{{PUSCH}\text{-}{initial}} \times N_{symb}^{{PUSCH}\text{-}{initial}} \times \beta_{offset}^{PUSCH}}{\sum\limits_{r = 0}^{C - 1}K_{r}} \right\rceil,{4 \times M_{sc}^{PUSCH}}} \right)}} & (2) \end{matrix}$

In the formula above, C is the number of code blocks generated by segmenting the data corresponding to the data transport block when performing channel coding; and K_(r) is the sum of the number of information bits of block r of the data transport block and the number of CRC bits.

502: Divide the information bit sequence of the UCI to be transmitted into two parts.

Note that in this embodiment, the information bit sequence of the UCI refers to the original information bit sequence of the UCI. For example, if the UCI to be transmitted is ACK/NACK composed of 12 bits, the information bit sequence in this embodiment is one of the corresponding 4096 information bit sequences, for example, 12 zeros.

This embodiment does not restrict the method of dividing the information bit sequence of the UCI into two parts. Preferably, the dividing method is: If the number of bits of the UCI is an even number, the information bit sequence is divided into two equal parts; if the number of bits of the UCI is an odd number, the information bit sequence is divided into two parts, with one part being greater than the other part by one bit.

503: Use RM (32, O) code to encode each part of the information bit sequence of the UCI to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching.

One of the two 32-bit coded bit sequences is the first 32-bit coded bit sequence, and the other is the second 32-bit coded bit sequence. Specifically, after the rate matching, the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence, and the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bit coded bit sequence; or, the first 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, and the second 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence. If Q′ is an even number, because ┌Q′/2┐×Q_(m)=(Q′−┌Q′/2┐)×Q_(m)=(Q′/2)×Q_(m), the foregoing process is equivalent to: performing rate matching so that the number of coded bits of each 32-bit coded bit sequence is (Q′/2)×Q_(m) bits.

Q_(m) is the modulation order corresponding to the UCI to be transmitted. In other words, Q_(m) is the modulation order corresponding to the data transport block multiplexed with the UCI. If the data transport block corresponds to multiple layers, Q_(m) is also known as the modulation order corresponding to the data on the layer which the UCI is mapped onto. The terminal is generally signalled of Q_(m) by the base station beforehand, and therefore, the terminal and the base station know the value of Q_(m) beforehand.

Specifically, the step of setting the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching includes:

If the value of ┌Q′/2┐×Q_(m) is less than or equal to 32 bits, selecting the first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence;

If the value of ┌Q′/2┐×Q_(m) is greater than 32 bits, according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), performing rate matching to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence, where q_(i) is the coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31)

is the first 32-bit coded bit sequence, O_(n) is the bit in the information bit sequence corresponding to the first 32-bit coded bit sequence, M_(j,n) is a basic sequence (shown in Table 1) of RM (32, O) code, and O′ is the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence. In this case, considering that O′ is the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence and O_(n) is the bit in the information bit sequence corresponding to the first 32-bit coded bit sequence, when n starts from 0, no bit like O_(O′) exists in the information bit sequence corresponding to the first 32-bit coded bit sequence. In other words, no O_(O′) bit exists. Therefore, the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

Specifically, the setting the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching includes:

If the value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32 bits, selecting the first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence;

If the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32 bits, according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), performing rate matching to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, where q_(i) is the coded bit sequence output after the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31)

is the second 32-bit coded bit sequence, O_(n) is the bit in the information bit sequence corresponding to the second 32-bit coded bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence. In this case, considering that O′ is the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence and O_(n) is the bit in the information bit sequence corresponding to the second 32-bit coded bit sequence, when n starts from 0, no bit like O_(O′) exists in the information bit sequence corresponding to the second 32-bit coded bit sequence. In other words, no O_(O′) bit exists. Therefore, the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

TABLE 1 M_(j, 0) M_(j, 1) M_(j, 2) M_(j, 3) M_(j, 4) M_(j, 5) M_(j, 6) M_(j, 7) M_(j, 8) M_(j, 9) M_(j, 10) 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 2 1 0 0 1 0 0 1 0 1 1 1 3 1 0 1 1 0 0 0 0 1 0 1 4 1 1 1 1 0 0 0 1 0 0 1 5 1 1 0 0 1 0 1 1 1 0 1 6 1 0 1 0 1 0 1 0 1 1 1 7 1 0 0 1 1 0 0 1 1 0 1 8 1 1 0 1 1 0 0 1 0 1 1 9 1 0 1 1 1 0 1 0 0 1 1 10 1 0 1 0 0 1 1 1 0 1 1 11 1 1 1 0 0 1 1 0 1 0 1 12 1 0 0 1 0 1 0 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 14 1 0 0 0 1 1 0 1 0 0 1 15 1 1 0 0 1 1 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 17 1 0 0 1 1 1 0 0 1 0 0 18 1 1 0 1 1 1 1 1 0 0 0 19 1 0 0 0 0 1 1 0 0 0 0 20 1 0 1 0 0 0 1 0 0 0 1 21 1 1 0 1 0 0 0 0 0 1 1 22 1 0 0 0 1 0 0 1 1 0 1 23 1 1 1 0 1 0 0 0 1 1 1 24 1 1 1 1 1 0 1 1 1 1 0 25 1 1 0 0 0 1 1 1 0 0 1 26 1 0 1 1 0 1 0 0 1 1 0 27 1 1 1 1 0 1 0 1 1 1 0 28 1 0 1 0 1 1 1 0 1 0 0 29 1 0 1 1 1 1 1 1 1 0 0 30 1 1 1 1 1 1 1 1 1 1 1 31 1 0 0 0 0 0 0 0 0 0 0

Note that the rate matching method greater than 32 bits may be called a circular repetition rate matching method, or all the rate matching methods under each mode, including the rate matching method less than or equal to 32 bits and the rate matching method greater than 32 bits, are collectively called “the circular repetition rate matching method”.

In this step, each part of the information bit sequence of the UCI is encoded to generate a 32-bit coded bit sequence respectively, and rate matching is performed by circular repetition for each 32-bit coded bit sequence, and therefore, compared with Embodiment 1 above, this embodiment makes each part of information bit sequence of the UCI obtain enough coding gain when (Q′/2)×Q_(m) is greater than 24 bits, and improves transmission performance of the UCI.

504: Apply one of the following modes to process the two parts of coded bit sequence, which are obtained in step 503 and have undergone rate matching:

Mode 1: Concatenate the two parts of coded bit sequences that have undergone rate matching to form a new bit sequence;

Mode 2: Based on the two parts of coded bit sequences that have undergone rate matching, generate a new bit sequence by selecting alternately 4Q_(m) coded bits in one part and 4Q_(m) coded bits in the other part. In other words, select 4Q_(m) coded bits in the first 32-bit coded bit sequence that has undergone rate matching, and then select 4Q_(m) coded bits in the second 32-bit coded bit sequence that has undergone rate matching, and go on selecting alternately the coded bits in the first part and the coded bits in the second part until the two parts of coded bit sequences that have undergone rate matching are finished; and

Mode 3: Select alternately Q_(m) coded bits in one of the two parts of the coded bit sequences that have undergone rate matching and Q_(m) coded bits in the other part of coded bit sequence; after 4Q_(m) coded bits are selected, switch the order of selecting alternately the two parts of coded bit sequences that have undergone rate matching, and go on selecting the coded bits alternately to form a new bit sequence. In other words, based on the two 32-bit coded bit sequences that have undergone rate matching, select Q_(m) coded bits in the first 32-bit coded bit sequence, and then select Q_(m) coded bits in the second 32-bit coded bit sequence, and go on selecting the coded bits alternately; after 4Q_(m) coded bits are selected, switching the selection order, namely, select Q_(m) coded bits in the second 32-bit coded bit sequence, and then select Q_(m) coded bits in the first 32-bit coded bit sequence, and go on selecting the coded bits alternately; repeat the foregoing process until the two parts of coded bit sequences that have undergone rate matching are finished.

This step is optional. That is, step 504 may be performed or not.

505: Map the two parts of coded bit sequences of the UCI that have undergone rate matching onto a PUSCH, and transmit the two parts of the coded bit sequences to a base station.

If step 504 is not performed in this embodiment, the two parts of coded bit sequences, which are obtained in step 503 and have undergone rate matching, may be mapped onto the PUSCH, and transmitted to the base station.

If step 504 is performed in this embodiment, the two parts of coded bit sequences, which are obtained in step 503 and have undergone rate matching, are processed in step 504 to generate a new bit sequence, and the new bit sequence is mapped onto the PUSCH and transmitted to the base station. Specifically, if mode 1 in step 504 is applied, the new bit sequence is mapped onto the PUSCH and transmitted, and the UCI resource mapping on each layer of the PUSCH is shown in FIG. 7; if mode 2 in step 504 is applied, the new bit sequence is mapped onto the PUSCH and transmitted, and the UCI resource mapping on each layer of the PUSCH is shown in FIG. 8; if mode 3 in step 504 is applied, the new bit sequence is mapped onto the PUSCH and transmitted, and the UCI resource mapping on each layer of the PUSCH is shown in FIG. 9.

In the resource mapping of the technical solution of Embodiment 1 shown in FIG. 2, the bit sequence corresponding to each part of the UCI in the technical solution of Embodiment 1 is mapped onto only two of the 4 SC-FDMA symbols. By contrast, in this embodiment, after mode 1, mode 2 or mode 3 in this embodiment is applied, the bit sequence corresponding to each part of the UCI may be mapped to 4 SC-FDMA symbols. That is, the bit sequence corresponding to each part of the UCI is distributed on the time-frequency resources discretely, thereby achieving enough time diversity gain and frequency diversity gain and improving transmission performance of the UCI.

The step of mapping the two parts of coded bit sequences that have undergone rate matching onto the PUSCH and transmitting the coded bit sequences to the base station further includes: performing channel interleaving, scrambling, modulation, Discrete Fourier Transformation (DFT) and resource mapping for the two parts of coded bit sequences that have undergone rate matching, data, and other UCI information such as CQI, which are then transmitted to the base station. The specific mapping method is not limited in this embodiment, and may be a method in the prior art.

The base station receives the UCI transmitted together with the data. As shown in FIG. 10, this embodiment provides a method for receiving UCI. The method includes the following steps:

601: Receive UCI sent by a terminal.

This step includes the following two steps:

601 a: Calculate the number Q′ of modulation symbols occupied by the UCI sent by the terminal.

If the PUSCH corresponds to multiple layers, this step calculates the number of modulation symbols occupied by the UCI on each layer of the PUSCH.

This step is the same as step 501.

601 b: Separate the UCI transmitted together with the data according to Q′.

In this step, the base station separates the UCI transmitted together with the data, and specifically, separates the modulation symbols corresponding to the UCI transmitted together with the data, according to the number of modulation symbols occupied by the UCI in step 601 a, or further according to the step of channel de-interleaving.

If step 504 is performed in this embodiment, the base station in this step may, according to the corresponding mode in step 504, separate the modulation symbols corresponding to each part of the coded bit sequence that has undergone rate matching in step 503. If mode 1 in step 504 is applied to combine the two parts of coded bit sequences that have undergone rate matching in step 503, this step may separate the modulation symbols corresponding to each part of UCI respectively according to the resource location shown in FIG. 7; if mode 2 in step 504 is applied to combine the two parts of coded bit sequences that have undergone rate matching in step 503, this step may separate the modulation symbols corresponding to each part of UCI respectively according to the resource location shown in FIG. 8; if mode 3 in step 504 is applied to combine the two parts of coded bit sequences that have undergone rate matching in step 503, this step may separate the modulation symbols corresponding to each part of UCI respectively according to the resource location shown in FIG. 9.

602: Determine candidate control information bit sequences according to the number of bits of the UCI to be detected, and encode each candidate control information bit sequence.

Specifically, find all the bit sequences which include bits with the number equivalent to the number of bits of the UCI to be detected, and use the bit sequences as candidate control information bit sequences. For example, when the number of bits of UCI transmitted together with the data is 12, there are 2¹² candidate control information bit sequences.

The base station encodes each candidate control information bit sequence respectively, and the encoding includes the following steps:

602 a: Divide each candidate control information bit sequence into two parts.

This step is the same as step 502.

602 b: Use RM (32, O) code to encode each part of the candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set the second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI, and ┌ ┐ refers to rounding up.

This step is the same as step 503.

602 c: In the same way as step 504, combine the two parts of coded bit sequences which are obtained in step 602 b and have undergone rate matching.

This step is optional. If step 504 is performed on the User Equipment (UE), step 602 c needs to be performed in this embodiment; if step 504 is not performed on the UE, step 602 c does not need to be performed in this embodiment.

603: Detect the UCI by using the two parts of coded bit sequences which correspond to each candidate control information bit sequence and have undergone rate matching, with a view to judging whether the candidate control information bit sequence is the UCI bit sequence transmitted by the UE.

If step 602 c is not performed in this embodiment, this step detects the UCI to be detected according to the two parts of coded bit sequences which are obtained in step 602 and have undergone rate matching; if step 602 c is performed in this embodiment, this step detects the UCI to be detected according to the new bit sequence which is obtained in step 602.

The detection criteria in this step come in many types. Taking the maximum likelihood detection as an example, the base station encodes each candidate control information bit sequence according to step 602, modulates the encoded candidate control information bit sequence, conjugate-multiplies the modulated result by the modulation symbols corresponding to the UCI separated in step 601, adds up the products to obtain a sum, and takes the real part of the sum as a likelihood value; or, the base station conjugate-multiplies the local pilot symbol by the received pilot symbol, adds up the products corresponding to multiple pilot symbols to obtain a first sum, adds up the products corresponding to the candidate control information to obtain a second sum, adds the first sum to the second sum to obtain a new sum, and takes the real part of the new sum as a likelihood value; the base station uses the candidate control information bit sequence corresponding to the greatest likelihood value as the UCI bit sequence transmitted by the UE.

Through the transmitting method provided in this embodiment, the information bit sequence of the UCI is divided into two parts, and each part is encoded to generate a 32-bit coded bit sequence respectively; rate matching is performed for each 32-bit coded bit sequence respectively and then the coded bit sequence is transmitted, and therefore, the UCI which occupies bits more than the maximum number of bits supported by RM (32, O) code is transmitted properly. Compared with the technical solution in Embodiment 1 above, this embodiment makes each part of information bit sequence of the UCI obtain enough coding gain even if the (Q′/2)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

The receiving method provided in this embodiment corresponds to the transmitting method provided in this embodiment. Through this receiving method, the terminal side can transmit UCI according to the transmission method provided in this embodiment, and therefore, the UCI can be transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by RM (32, O) code. Compared with the technical solution in Embodiment 1 above, this embodiment makes each part of information bit sequence of the UCI obtain enough coding gain even if the (Q′/2)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

Embodiment 4

As shown in FIG. 11, a terminal provided in this embodiment includes:

a calculating module 701, configured to calculate the number Q′ of modulation symbols occupied by UCI to be transmitted, and obtain modulation order Q_(m) corresponding to the UCI to be transmitted;

a first dividing module 702, configured to divide an information bit sequence of the UCI to be transmitted in the calculating module 701 into two parts;

a first encoding module 703, configured to use RM (32, O) code to encode each part of the information bit sequence of the UCI to be transmitted, which is divided by the first dividing module 702, to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set a first 32-bit coded bit sequence to ┌Q/2┐×Q_(m) bits coded bit sequence through rate matching and to set a second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is the modulation order corresponding to the UCI to be transmitted, and ┌ ┐ refers to rounding up; and

a transmitting module 704, configured to map the two parts of coded bit sequences that are obtained by the first encoding module 703 and have undergone rate matching onto a PUSCH, and transmit the two parts of the coded bit sequences to a base station.

The transmitting module 704 includes at least one of the following transmitting units:

a first transmitting unit, configured to concatenate the two parts of coded bit sequences that are obtained by the first encoding module 703 and have undergone rate matching to form a new bit sequence, map the new bit sequence onto the PUSCH, and transmit the new bit sequence to the base station;

a second transmitting unit, configured to select alternately 4Q_(m) coded bits in one of the two parts of coded bit sequences that are obtained by the first encoding module 703 and have undergone rate matching and 4Q_(m) coded bits in the other part of coded bit sequence to form a new bit sequence, map the new bit sequence onto the PUSCH, and transmit the new bit sequence to the base station; and

a third transmitting unit, configured to select alternately Q_(m) coded bits in one of the two parts of coded bit sequences that are obtained by the first encoding module 703 and have undergone rate matching and Q_(m) coded bits in the other part of coded bit sequence, and, after 4Q_(m) coded bits are selected, switch the order of selecting alternately the two parts of coded bit sequences that are obtained by the first encoding module 703 and have undergone rate matching, go on selecting the coded bits alternately to form a new bit sequence, map the new bit sequence onto the PUSCH and transmit the new bit sequence to the base station.

The first encoding module 703 includes:

a first encoding unit, configured to use RM (32, O) code to encode each part of information bit sequence of the UCI to be transmitted that is divided by the first dividing module 702 to obtain a 32-bit coded bit sequence respectively;

a first obtaining unit, configured to obtain the bit O_(n) of the information bit sequence corresponding to the first 32-bit coded bit sequence obtained by the first encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence;

a first rate matching unit, configured to: select the first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence obtained by the first encoding unit if the value of ┌Q′/2┐×Q_(m) is less than or equal to 32 bits, or perform rate matching for the first 32-bit coded bit sequence to set the sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)) if the value of ┌Q′/2┐×Q_(m) is greater than 32 bits, where q_(i) is a coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31)

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the first obtaining unit; in this case, considering that O′ is the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence and O_(n) is the bit in the information bit sequence corresponding to the first 32-bit coded bit sequence, when n starts from 0, no bit like O_(O′) exists in the information bit sequence corresponding to the first 32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore, the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}};$

a second obtaining unit, configured to obtain the bit O_(n) of the information bit sequence corresponding to the second 32-bit coded bit sequence obtained by the first encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence; and

a second rate matching unit, configured to: select the first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence obtained by the first encoding unit if the value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32 bits, or perform rate matching for the second 32-bit coded bit sequence to set the sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)) if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32 bits, where q_(i) is a coded bit sequence output after the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31)

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the second obtaining unit; in this case, considering that O′ is the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence and O_(n) is the bit in the information bit sequence corresponding to the second 32-bit coded bit sequence, when n starts from 0, no bit like O_(O′) exists in the information bit sequence corresponding to the second 32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore, the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

The terminal provided in this embodiment is based on the same conception of the terminals disclosed in Embodiment 2 and Embodiment 3 of the methods above. For the detailed implementation process of the terminal, see Embodiment 2 and Embodiment 3 of the methods above.

In this embodiment, the information bit sequence of the UCI is divided into two parts, and each part is encoded to generate a 32-bit coded bit sequence respectively; rate matching is performed for each 32-bit coded bit sequence respectively and then the coded bit sequence is transmitted, and therefore, the UCI which occupies bits more than the maximum number of bits supported by RM (32, O) code is transmitted properly. Moreover, each part of information bit sequence of the UCI obtains enough coding gain even if (Q′/2)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

Embodiment 5

As shown in FIG. 12, a base station provided in this embodiment includes:

a receiving module 801, configured to receive UCI sent by a terminal, calculate the number Q′ of modulation symbols occupied by the UCI, and obtain modulation order Q_(m) corresponding to the UCI;

a determining module 802, configured to determine candidate control information bit sequences according to the number of bits of the UCI received by the receiving module 801;

a second dividing module 803, configured to divide each candidate control information bit sequence determined by the determining module 802 into two parts;

a second encoding module 804, configured to use RM (32, O) code to encode each part of each candidate control information bit sequence divided by the second dividing module 803 to obtain a 32-bit coded bit sequence respectively, and perform rate matching for each 32-bit coded bit sequence to set a first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching and to set a second 32-bit coded bit sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching, where Q_(m) is modulation order corresponding to the UCI, and ┌ ┐ refers to rounding up; and

a detecting module 805, configured to detect the UCI by using the two parts of coded bit sequences which are obtained by the second encoding module 804, correspond to each candidate control information bit sequence and have undergone rate matching.

The detecting module 805 includes at least one of the following detecting units:

a first detecting unit, configured to concatenate the two parts of coded bit sequences that are obtained by the second encoding module 804 and have undergone rate matching to form a new bit sequence, and use the new bit sequence to detect the UCI;

a second detecting unit, configured to select alternately 4Q_(m) coded bits in one of the two parts of coded bit sequences that that are obtained by the second encoding module 804 and have undergone rate matching and 4Q_(m) coded bits in the other part of coded bit sequence to form a new bit sequence, and use the new bit sequence to detect the UCI; and

a third detecting unit, configured to select alternately Q_(m) coded bits in one of the two parts of coded bit sequences that are obtained by the second encoding module 804 and have undergone rate matching and Q_(m) coded bits in the other part of coded bit sequence, and, after 4Q_(m) coded bits are selected, switch the order of selecting alternately the two parts of coded bit sequences that have undergone rate matching, go on selecting the coded bits alternately to form a new bit sequence, and use the new bit sequence to detect the UCI.

The second encoding module 804 includes:

a second encoding unit, configured to use RM (32, O) code to encode each part of each candidate control information bit sequence divided by the second dividing module 803 to obtain a 32-bit coded bit sequence respectively;

a third obtaining unit, configured to obtain the bit O_(n) of the information bit sequence corresponding to the first 32-bit coded bit sequence obtained by the second encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence;

a third rate matching unit, configured to: select the first ┌Q′/2┐×Q_(m) bits in the first 32-bit coded bit sequence if the value of ┌Q′/2┐×Q_(m) is less than or equal to 32 bits, or perform rate matching for the first 32-bit coded bit sequence to set the sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)) if the value of ┌Q′/2┐×Q_(m) is greater than 32 bits, where q_(i), is a coded bit sequence output after the first 32-bit coded bit sequence is set to ┌Q′/2┐×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31)

is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the third obtaining unit; in this case, considering that O′ is the number of bits of the information bit sequence corresponding to the first 32-bit coded bit sequence and O_(n) is the bit in the information bit sequence corresponding to the first 32-bit coded bit sequence, when n starts from 0, no bit like O_(O′) exists in the information bit sequence corresponding to the first 32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore, the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

${b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}};$

a fourth obtaining unit, configured to obtain the bit O_(n) of the information bit sequence corresponding to the second 32-bit coded bit sequence obtained by the second encoding unit, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence; and

a fourth rate matching unit, configured to: select the first (Q′−┌Q′/2┐)×Q_(m) bits in the second 32-bit coded bit sequence if the value of (Q′−┌Q′/2┐)×Q_(m) is less than or equal to 32 bits, or perform rate matching for the second 32-bit coded bit sequence to set the sequence to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)) if the value of (Q′−┌Q′/2┐)×Q_(m) is greater than 32 bits, where q_(i) is a coded bit sequence output after the second 32-bit coded bit sequence is set to (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence through rate matching,

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31)

is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the fourth obtaining unit; in this case, considering that O′ is the number of bits of the information bit sequence corresponding to the second 32-bit coded bit sequence and O_(n) is the bit in the information bit sequence corresponding to the second 32-bit coded bit sequence, when n starts from 0, no bit like O_(O′) exists in the information bit sequence corresponding to the second 32-bit coded bit sequence, namely, no O_(O′) bit exists, and therefore, the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime}}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$

is equivalent to the formula

$b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2.}}$

The base station provided in this embodiment is based on the same conception of the base stations disclosed in method embodiment 2 and method embodiment 3 above. For the detailed implementation process of the base station, see method embodiment 2 and method embodiment 3 above.

The embodiment provides a base station corresponding to the terminal transmission method. The base station enables the terminal side to transmit UCI according to the transmission method provided in this embodiment, and therefore, the UCI can be transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by RM (32, O) code. Moreover, each part of information bit sequence of the UCI obtains enough coding gain even if (Q′/2)×Q_(m) is greater than 24 bits, thereby improving transmission performance of the UCI.

Embodiment 6

As shown in FIG. 13, this embodiment provides a method for transmitting UCI. On the terminal side, the method includes the following steps:

901: Calculate the number Q′ of modulation symbols occupied by the UCI to be transmitted.

This step is the same as step 501.

902: Divide the information bit sequence of the UCI to be transmitted into two parts.

This step is the same as step 502.

903: Use RM (32, O) code to encode each part of information bit sequence of the UCI to obtain a 32-bit coded bit sequence respectively.

Specifically, the calculation formula of b_(j) in Embodiment 3 may be applied in this step. For details, see the third embodiment.

904: Apply one of the following modes to process the two 32-bit coded bit sequences obtained in step 903:

Mode 1: Concatenate the two 32-bit coded bit sequences to form a new bit sequence;

Mode 2: Select alternately Q_(m) coded bits in one of the 32-bit coded bit sequences and Q_(m) coded bits in the other 32-bit coded bit sequence to form a new 64-bit coded bit sequence;

Mode 3: Select alternately 4^(Q) ^(m) coded bits in one of the 32-bit coded bit sequences and 4^(Q) ^(m) coded bits in the other 32-bit coded bit sequence to form a new coded bit sequence; and

Mode 4: Select alternately Q_(m) coded bits in one of the two 32-bit coded bit sequences and Q_(m) coded bits in the other 32-bit coded bit sequence; after 4^(Q) ^(m) coded bits are selected, switch the order of selecting alternately the two 32-bit coded bit sequences, and go on selecting the coded bits alternately to form a new bit sequence.

905: Perform rate matching for the new bit sequence obtained in step 904 to set the new bit sequence to Q′×Q_(m) bits coded bit sequence.

Q_(m) above is the modulation order corresponding to the UCI to be transmitted.

This step may be performed in the following way:

Select the first Q′×Q_(m) bits in 64 coded bits if the value of Q′×Q_(m) is less than or equal to 64 bits, or perform circular repetition matching for the 64-bit coded bits to set the sequence to Q′×Q_(m) bits coded bit sequence if the value of Q′×Q_(m) is greater than 64 bits. Specifically, the rate matching may be performed according to formula (3). For example, if the value of Q′×Q_(m) is 96, append the first 32 bits in the 64 bits to the 64 bits to form 96 bits. The formula is:

q′ _(i) =b′ _((imod64)) ,i=0,1, . . . , Q′·Q _(m)−1  (3)

In the formula above, q′_(i) is a coded bit sequence output after rate matching, j=i mod 64, and b′_(j) is the 64-bit coded bit sequence obtained in step 904.

906: Map the coded bit sequence that has undergone rate matching in step 905 onto a PUSCH, and transmit the coded bit sequence to a base station.

In the transmission method provided in this embodiment, the information bit sequence of the UCI is divided into two parts, and each part is encoded by using RM (32, O) code to obtain a 32-bit coded bit sequence respectively; and one of the modes specified in step 904 is applied to select alternately coded bits in one of the two 32-bit coded bit sequences and coded bits in the other 32-bit coded bit sequence to obtain a 64-bit coded bit sequence; and rate matching is performed for the 64-bit coded bit sequence to set the sequence to Q′×Q_(m) bits coded bit sequence, and then the sequence is transmitted. In this way, the UCI is transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by the RM (32, O) code.

As shown in FIG. 14, this embodiment provides a method for receiving UCI. On the base station side, the method includes the following steps:

1001: Receive UCI sent by a terminal.

This step includes the following two steps:

1001 a: Calculate the number Q′ of modulation symbols occupied by the UCI sent by the terminal.

This step is the same as step 901.

1001 b: Separate the UCI transmitted together with the data according to Q′.

In this step, the base station separates the UCI transmitted together with the data, and specifically, separates the modulation symbols corresponding to the UCI transmitted together with the data, according to the number of modulation symbols occupied by the UCI in step 1,001 a, or further according to the step of channel de-interleaving.

1002: Determine multiple candidate control information bit sequences according to the number of bits of the UCI, and encode each candidate control information bit sequence.

Specifically, find all the bit sequences which include bits with the number equivalent to the number of bits of the UCI to be detected, and use the bit sequences as candidate control information bit sequences. For example, when the number of bits of UCI transmitted together with the data is 12, there are 2¹² candidate control information bit sequences.

The base station encodes each candidate control information bit sequence respectively, and the encoding includes the following steps:

1002 a: Divide each candidate control information bit sequence into two parts.

1002 b. Use RM (32, O) code to encode each part of the candidate control information bit sequence to obtain a 32-bit coded bit sequence respectively.

1002 c: Apply one of the following modes to process the two 32-bit coded bit sequences obtained in step 1002 b:

Mode 1: Concatenate the two 32-bit coded bit sequences to form a new bit sequence;

Mode 2: Select alternately Q_(m) coded bits in one of the 32-bit coded bit sequences and Q_(m) coded bits in the other 32-bit coded bit sequence to form a new 64-bit coded bit sequence;

Mode 3: Select alternately 4^(Q) ^(m) coded bits in one of the 32-bit coded bit sequences and 4^(Q) ^(m) coded bits in the other 32-bit coded bit sequence to form a new coded bit sequence; and

Mode 4: Select alternately Q_(m) coded bits in one of the two 32-bit coded bit sequences and Q_(m) coded bits in the other 32-bit coded bit sequence; after 4^(Q) ^(m) coded bits are selected, switch the order of selecting alternately the two 32-bit coded bit sequences, and go on selecting the coded bits alternately to form a new bit sequence.

1002 d: Perform rate matching for the bit sequence obtained in step 1002 c to set the sequence to Q′×Q_(m) bits coded bit sequence.

This step is the same as step 905.

1003: Detect the UCI according to the coded bit sequence that has undergone rate matching.

The detection criteria in this step come in many types such as maximum likelihood, and are not limited herein.

The receiving method provided in this embodiment corresponds to the transmitting method provided in this embodiment. Through this receiving method, the terminal side can transmit UCI according to the transmission method provided in this embodiment, and therefore, the UCI can be transmitted properly even if the number of bits occupied by the UCI exceeds the maximum number of bits supported by RM (32, O) code.

All or part of the contents in the technical solution provided in the foregoing embodiments may be implemented through software programming, and the software program is stored in readable storage media such as a computer hard disk, floppy disk, or optical disk.

The above descriptions are merely exemplary embodiments, but are not intended to limit the scope of the claims. Modifications, variations or replacement that can be easily derived based on these embodiments are understood to fall within the protection scope of the claims. 

What is claimed is:
 1. A method for transmitting Uplink Control Information, comprising: calculating the number of modulation symbols Q′, wherein the modulation symbols are occupied by the Uplink Control Information (UCI) to be transmitted; dividing an information bit sequence of the UCI to be transmitted into a first information bit sequence and a second information bit sequence; using a Reed Muller RM (32, O) code to encode the first information bit sequence to obtain a first 32-bit coded bit sequence; using a Reed Muller RM (32, O) code to encode the second information bit sequence to obtain a second 32-bit coded bit sequence; performing rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bit sequence; performing rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein Q_(m) is a modulation order corresponding to the UCI to be transmitted, and ┌ ┐ refers to rounding up; mapping the ┌Q′/2┐×Q_(m) a bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence onto a Physical Uplink Shared Channel (PUSCH); and transmitting the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence to a base station.
 2. The method according to claim 1, wherein mapping the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence onto a Physical Uplink Shared Channel (PUSCH) comprise: concatenating the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence to form a new bit sequence; and mapping the new bit sequence onto the PUSCH.
 3. The method according to claim 1, wherein performing rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to ┌Q′/2┐×Q_(m) bits coded bit sequence comprises: according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), performing rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to the ┌Q′/2┐×Q_(m) bits coded bit sequence, wherein q_(i), is the ┌Q′/2┐×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the first 32-bit coded bit sequence, O_(n) is a bit in the first information bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is a number of bits of the first information bit sequence.
 4. The method according to claim 1, wherein performing rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence comprises: according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), performing rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i), is the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the second 32-bit coded bit sequence, O_(n) is a bit in the second information bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is a number of bits of the second information bit sequence.
 5. A method for receiving Uplink Control Information, comprising: receiving the Uplink Control Information from a terminal; calculating the number of modulation symbols Q′, wherein the modulation symbols are occupied by the Uplink Control Information; determining candidate control information bit sequences according to a number of bits of the Uplink Control Information; dividing each candidate control information bit sequence into a first candidate information bit sequence and a second candidate information bit sequence; using a Reed Muller RM (32, O) code to encode the first candidate control information bit sequence to obtain a first 32-bit coded bit sequence; using a Reed Muller RM (32, O) code to encode the second candidate information bit sequence to obtain a second 32-bit coded bit sequence; performing rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bit sequence; performing rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein Q_(m) is modulation order corresponding to the Uplink Control Information, and ┌ ┐ refers to rounding up; and detecting the Uplink Control Information by using the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence of each candidate control information bit sequence.
 6. The method according to claim 5, wherein detection of the Uplink Control Information by using the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence of each candidate control information bit sequence comprises: concatenating the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence of each candidate control information bit sequence to form a new bit sequence, and using the new bit sequence to detect the Uplink Control Information.
 7. The method according to claim 5, wherein performing rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence comprises: according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), performing rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to the ┌Q′/2┐×Q_(m) bits coded bit sequence, wherein q_(i) is the ┌Q′/2┐×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the first 32-bit coded bit sequence, O_(n) is a bit in the first candidate information bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is a number of bits of the first candidate information bit sequence.
 8. The method according to claim 5, wherein performing rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence comprises: according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), performing rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein q_(i) is the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the second 32-bit coded bit sequence, O_(n) is a bit in the second candidate information bit sequence, M_(j,n) is a basic sequence of RM (32, O) code, and O′ is the number of bits of the second candidate information bit sequence.
 9. A terminal, comprising: a processor configured to: calculate the number of modulation symbols Q′, wherein the modulation symbols are occupied by Uplink Control Information (UCI) to be transmitted, and obtain a modulation order Q_(m) corresponding to the UCI to be transmitted; divide an information bit sequence of the UCI to be transmitted in the calculating module into a first information bit sequence and a second information bit sequence; use a Reed Muller (RM) (32, O) code to encode the first information bit sequence to obtain a first 32-bit coded bit sequence; use a Reed Muller RM (32, O) code to encode the second information bit sequence to obtain a second 32-bit coded bit sequence; perform rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bit sequence; and perform rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein Q_(m) is the modulation order corresponding to the UCI to be transmitted, and ┌ ┐ refers to rounding up; and map the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence onto a Physical Uplink Shared Channel (PUSCH), and a transmitter configured to transmit the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit to a base station.
 10. The terminal according to claim 9, wherein the processor being configured to map the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence onto the PUSCH comprises: being configured to concatenate the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence to form a new bit sequence, map the new bit sequence onto the PUSCH.
 11. The terminal according to claim 9, wherein the processor is further configured to obtain a bit O_(n) of the first candidate information bit sequence, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the first information bit sequence; in order to perform rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bit sequence the processor is configured to: perform rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to the ┌Q′/2┐×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), wherein q_(i) is the ┌Q′/2┐×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the processor.
 12. The terminal according to claim 9, wherein the processor is further configured to obtain a bit O_(n) of the second information bit sequence, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being the number of bits of the second information bit sequence; and in order to perform rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence the processor is configured to: perform rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), wherein q_(i) is the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the processor.
 13. A base station, comprising: a receiver configured to receive Uplink Control Information sent by a terminal; and a processor configured to calculate a number of modulation symbols Q′, wherein the modulation symbols are occupied by the Uplink Control Information, and obtain modulation order Q_(m) corresponding to the Uplink Control Information; determine candidate control information bit sequences according to the number of bits of the Uplink Control Information received by the receiving module; divide each candidate control information bit sequence determined by the determining module into a first candidate information bit sequence and a second candidate information bit sequence; use a Reed Muller (RM) (32, O) code to encode the first candidate control information bit sequence to obtain a first 32-bit coded bit sequence; use a Reed Muller RM (32, O) code to encode the second candidate information bit sequence to obtain a second 32-bit coded bit sequence; perform rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a ┌Q′/2┐×Q_(m) bits coded bit sequence; and perform rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, wherein Q_(m) is modulation order corresponding to the Uplink Control Information, and ┌ ┐ refers to rounding up; and detect the Uplink Control Information by using the ┌Q′/2┐×Q_(m) bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence of each candidate control information bit sequence.
 14. The base station according to claim 13, wherein in order to detect the Uplink Control Information the processor is configured to: concatenate the ┌Q′/2┐×Q_(m) a bits coded bit sequence and the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence of each candidate control information bit sequence to form a new bit sequence, and use the new bit sequence to detect the Uplink Control Information.
 15. The base station according to claim 13, wherein the processor is further configured to obtain a bit O_(n) of the first candidate information bit sequence, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being a number of bits of the first candidate information bit sequence; in order to perform rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence the processor is configured to: perform rate matching for the first 32-bit coded bit sequence by circular repetition to set the first 32-bit coded bit sequence to the ┌Q′/2┐×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , (┌Q′/2┐×Q_(m)−1)), wherein q_(i) is the ┌Q′/2┐×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the first 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the processor.
 16. The base station according to claim 13, wherein the processor is further configured to obtain a bit O_(n) of the second candidate information bit sequence, a basic sequence M_(j,n) of the RM (32, O) code, and O′ being a number of bits of the second candidate information bit sequence; and in order to perform rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to a (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence the processor is configured to: perform rate matching for the second 32-bit coded bit sequence by circular repetition to set the second 32-bit coded bit sequence to the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence according to q_(i)=b_((imod32)) (i=0,1, . . . , ((Q′−┌Q′/2┐)×Q_(m)−1)), wherein q_(i) is the (Q′−┌Q′/2┐)×Q_(m) bits coded bit sequence, $b_{j} = {\sum\limits_{n = 0}^{O^{\prime} - 1}{\left( {O_{n} \times M_{j,n}} \right){mod}\; 2}}$ (j = 0, 1, …  , 31) is the second 32-bit coded bit sequence, and O_(n), M_(j,n) and O′ are parameters obtained by the processor. 